Distributed Approximation - A Survey 1
نویسندگان
چکیده
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue contains two items: • An eulogy in memory of Larry Stockmeyer, who passed away on July 31, 2004. Larry did pioneering work in various areas, such as complexity theory, logic, interactive proofs, distributed computing, parallel computing, secure architectures, database privacy, and storage systems. A celebration of Larry’s work will be held May 21–22, 2005, in conjunction with STOC 2005 (May 22–24). On May 21, a tutorial by Nick Pippenger (Princeton) on some of Stockmeyer’s fundamental results in complexity theory will be followed by lectures by Miki Ajtai (IBM), Anne Condon (UBC), Cynthia Dwork (Microsoft), Richard Karp (UC Berkeley), Albert Meyer (MIT), and Chris Umans (CalTech). Some time will be reserved for personal remarks. If you wish to speak in this part of Larry’s commemoration contact Cynthia Dwork ([email protected]). The celebration of Stockmeyer’s work will conclude on May 22, with Lance Fortnow giving a keynote address to STOC. • “Distributed Approximation,” a survey by Michael Elkin. Considerable progress has been recently achieved in designing efficient distributed approximation algorithms, and in demonstrating hardness of distributed approximation for various problems. An overview of the research in this area is presented, including several directions for future research. Many thanks to Michael for his contribution to this issue. Request for Collaborations: Please send me any suggestions for material I should be including in this column, including news and communications, open problems, and authors willing to write a guest column or to review an event related to theory of distributed computing. ∗Instituto de Matemáticas, UNAM. Ciudad Universitaria, Mexico City, D.F. 04510 [email protected].
منابع مشابه
A Survey on Buckling and Vibrations of a Viscoelastic Beam under Distributed Lateral and Axial Loads
In this paper, based on Kelvin and Linear Standard Solid models, dynamic response and the buckling load of a viscoelastic beam under lateral and axial loads have been determined. The governing equations have been extracted using Euler and Timoshenko theories and their analytical solutions have been obtained by using the eigenfunctions expansion method. Buckling load have been calculated by us...
متن کاملRadar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملA Recursive Approximation Approach of non-iid Lognormal Random Variables Summation in Cellular Systems
Co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. As the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal Random Variables (RVs) which has no closed-form expression. Assuming independent, identically distributed (iid) RVs, the...
متن کاملRadar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملA New Load-Flow Method in Distribution Networks based on an Approximation Voltage-Dependent Load model in Extensive Presence of Distributed Generation Sources
Power-flow (PF) solution is a basic and powerful tool in power system analysis. Distribution networks (DNs), compared to transmission systems, have many fundamental distinctions that cause the conventional PF to be ineffective on these networks. This paper presents a new fast and efficient PF method which provides all different models of Distributed Generations (DGs) and their operational modes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008